Joint Optimization and Reachability Analysis in Graph Transformation Systems with Time
نویسندگان
چکیده
منابع مشابه
Joint Optimization and Reachability Analysis in Graph Transformation Systems with Time
The design of safety critical systems frequently necessitates to simultaneously fulfill several logical and numerical constraints as requirements in order to deliver a functionally correct and optimal target system. In the current paper, we present a combined optimization and reachability analysis approach using the SPIN model checker [5] for problems modeled with graph transformation systems w...
متن کاملReachability Analysis on Timed Graph Transformation Systems
In recent years, software increasingly exhibits self-* properties like selfoptimization or self-healing. Such properties require reconfiguration at runtime in order to react to changing environments or detected defects. A reconfiguration might add or delete components as well as it might change the communication topology of the system. Considering communication protocols between an arbitrary nu...
متن کاملOptimization in Graph Transformation Systems with Time Using Petri Net Based Techniques
Extra–functional properties of IT systems have to be analyzed and subsequently optimized carefully during the design phase in order to assure a proper quality of service and decrease operational costs. Several verification and validation methods are known to check the correctness of the system services, while optimization may serve to reach boundaries thus minimizing costs or duration of operat...
متن کاملOptimization in Graph Transformation Systems Using Petri Net Based Techniques
The design of business or production systems frequently necessitates to simultaneously fulfill several logical and numerical constraints as requirements in order to deliver a functionally correct and optimal system. Such a problem can be typically formulated as a combined optimization and reachability analysis. In the current paper, we show how this problem can be formalized when the evolution ...
متن کاملOn the Decidability Status of Reachability and Coverability in Graph Transformation Systems
We study decidability issues for reachability problems in graph transformation systems, a powerful infinite-state model. For a fixed initial configuration, we consider reachability of an entirely specified configuration and of a configuration that satisfies a given pattern (coverability). The former is a fundamental problem for any computational model, the latter is strictly related to verifica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.02.062